closed walk - translation to ρωσικά
Display virtual keyboard interface

closed walk - translation to ρωσικά

IN GRAPH THEORY, PATH OF EDGES AND VERTICES WHEREIN A VERTEX IS REACHABLE FROM ITSELF
Directed cycle; Simple cycle; Graph cycle; Cycle (graph); Closed walk; Cycle detection (graph theory)
  • closed walk]] H–A–B–A–H in green, a circuit which is a closed walk in which all edges are distinct B–D–E–F–D–C–B in blue, and a cycle which is a closed walk in which all vertices are distinct but the first and last vertices H–D–G–H in red.

closed walk         

теория графов

замкнутый маршрут

simple cycle         

математика

простой цикл

directed cycle         

математика

направленный цикл

Ορισμός

ЗАМКНУТАЯ ТЕЛЕВИЗИОННАЯ СИСТЕМА
содержит: телевизионные передающие камеры (телекамеры) и расположенные на расстоянии до нескольких км от них видеоконтрольные устройства (ВКУ). Телекамеры, связанные с ВКУ кабельными линиями, управляются дистанционно или работают автоматически. Замкнутая телевизионная система используется для решения различных прикладных задач в промышленности, на транспорте, в медицине и т. д.

Βικιπαίδεια

Cycle (graph theory)

In graph theory, a cycle in a graph is a non-empty trail in which only the first and last vertices are equal. A directed cycle in a directed graph is a non-empty directed trail in which only the first and last vertices are equal.

A graph without cycles is called an acyclic graph. A directed graph without directed cycles is called a directed acyclic graph. A connected graph without cycles is called a tree.

Μετάφραση του &#39closed walk&#39 σε Ρωσικά